Sharp Lower Bound for the Total Number of Matchings of Tricyclic Graphs
نویسندگان
چکیده
منابع مشابه
Sharp Lower Bound for the Total Number of Matchings of Tricyclic Graphs
Let Tn be the class of tricyclic graphs on n vertices. In this paper, a sharp lower bound for the total number of matchings of graphs in Tn is determined.
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملThe Tight Upper Bound for the Number of Matchings of Tricyclic Graphs
In this paper, we determine the tight upper bound for the number of matchings of connected n-vertex tricyclic graphs. We show that this bound is 13fn−4+16fn−5, where fn be the nth Fibonacci number. We also characterize the n-vertex simple connected tricyclic graph for which the bound is best possible.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملThe Sharp Lower Bound for the Spectral Radius of Connected Graphs with the Independence Number
In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize all extremal connected graphs which attain the minimum value among the spectral radii of all connected graphs with order n = kα and the independence number α. Moreover, all extremal graphs which attain the maximum value among the spectral radii of clique trees with orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/404